Rounding Meshes in 3D
نویسندگان
چکیده
منابع مشابه
Embedding Pyramids into 3D Meshes
cessing and image understanding [11, 13]. The most efficient applications of the pyramid are in the areas of scalespace (or multiresolution) and coarse-to-fine operations. Multiscale or multiresolution image representation is a very powerful tool for analyzing numerous image features at multiple scales [6, 11]. Moreover, pyramid machines are not limited just to image processing tasks. By exploi...
متن کاملPerturbing Slivers in 3D Delaunay Meshes
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay for simplicity. The solution which explicitly perturbs the slivers through random vertex relocation and ...
متن کاملGenerating Well-Shaped Delaunay Meshes in 3D
A triangular mesh in 3D is a decomposition of a given geometric domain into tetrahedra. The mesh is wellshaped if the aspect ratio of every of its tetrahedra is bounded from above by a constant. It is Delaunay if the interior of the circum-sphere of each of its tetrahedra does not contain any other mesh vertices. Generating a well-shaped Delaunay mesh for any 3D domain has been a long term outs...
متن کاملApproximate Symmetry Detection in Partial 3D Meshes
Symmetry is a common characteristic in natural and man-made objects. Its ubiquitous nature can be exploited to facilitate the analysis and processing of computational representations of real objects. In particular, in computer graphics, the detection of symmetries in 3D geometry has enabled a number of applications in modeling and reconstruction. However, the problem of symmetry detection in in...
متن کاملEstimating Gaussian curvatures from 3D meshes
A new approach to estimate the surface curvatures from 3D triangular mesh surfaces with Gaussian curvature’s geometry interpretation is proposed in this work. Unlike previous work, the proposed method does not use local surface fitting, partial derivative computation, or oriented normal vector recovery. Instead, the Gaussian curvature is estimated at a vertex as the area of its small neighborho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2020
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-020-00202-2